Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching
نویسندگان
چکیده
منابع مشابه
Computation of Minimum-Volume Covering Ellipsoids
We present a practical algorithm for computing the minimum volume n-dimensional ellipsoid that must contain m given points a1, . . . , am ∈ R. This convex constrained problem arises in a variety of applied computational settings, particularly in data mining and robust statistics. Its structure makes it particularly amenable to solution by interior-point methods, and it has been the subject of m...
متن کاملOn the Minimum Volume Covering Ellipsoid of Ellipsoids
Let S denote the convex hull of m full-dimensional ellipsoids in Rn. Given > 0 and δ > 0, we study the problems of computing a (1 + )-approximation to the minimum volume covering ellipsoid of S and a (1 + δ)n-rounding of S. We extend the first-order algorithm of Kumar and Yıldırım that computes an approximation to the minimum volume covering ellipsoid of a finite set of points in Rn, which, in ...
متن کاملOn the Minimum Volume Covering Ellipsoid of Ellipsoids
We study the problem of computing a (1+ )-approximation to the minimum volume covering ellipsoid of a given set S of the convex hull of m full-dimensional ellipsoids in Rn. We extend the first-order algorithm of Kumar and Yıldırım that computes an approximation to the minimum volume covering ellipsoid of a finite set of points in Rn, which, in turn, is a modification of Khachiyan’s algorithm. F...
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
Linear convergence of a modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids
We show the linear convergence of a simple first-order algorithm for the minimum-volume enclosing ellipsoid problem and its dual, the D-optimal design problem of statistics. Computational tests confirm the attractive features of this method.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MENDEL
سال: 2019
ISSN: 2571-3701,1803-3814
DOI: 10.13164/mendel.2019.2.019